Cryptography based on number fields with large regulator

Cryptography Based on Number Fields with Large Regulator

We explain a variant of the Fiat-Shamir identification and signature protocol which is based on the intractability of computing generators of principal ideals in algebraic number fields. We also show how to use the Cohen-Lenstra-Martinet heuristics for class groups to construct number fields in which computing generators of principal ideals is intractable.

Cryptography based on number fields with large regulator par

We explain a variant of the Fiat-Shamir identification and signature protocol that is based on the intractability of computing generators of principal ideals in algebraic number fields. We also show how to use the Cohen-Lenstra-Martinet heuristics for class groups to construct number fields in which computing generators of principal ideals is intractable.

Cryptography Based on Number Fields with Largeregulatorjohannes Buchmann

We explain a variant of the Fiat-Shamir identiication and signature protocol which is based on the intractability of computing generators of principal ideals in algebraic number elds. We also show how to use the Cohen-Lenstra-Martinet heuristics for class groups to construct number elds in which computing generators of principal ideals is intractable. 1. Introduction The security of public key ...

Lattices from Totally Real Number Fields with Large Regulator

We look for examples of totally real number fields with large regulator and inert small primes inside some families of cyclotomic fields. This problem is motivated by the design of wiretap codes for fast fading Rayleigh channels.

On Real Quadratic Number Fields Suitable for Cryptography